Quasicontinuous Domains and the Smyth Powerdomain

نویسندگان

  • Reinhold Heckmann
  • Klaus Keimel
چکیده

In Domain Theory quasicontinuous domains pop up from time to time generalizing slightly the powerful notion of a continuous domain. It is the aim of this paper to show that quasicontinuous domains occur in a natural way in relation to the powerdomains of finitely generated and compact saturated subsets. Properties of quasicontinuous domains seem to be best understood from that point of view. This is in contrast to the previous approaches where the properties of a quasicontinuous domain were compared primarily with the properties of the lattice of Scott-open subsets. We present a characterization of those domains that occur as domains of nonempty compact saturated subsets of a quasicontinuous domain. A set theoretical lemma due to M. E. Rudin has played a crucial role in the development of quasicontinuous domains. We present a topological variant of Rudin’s Lemma where irreducible sets replace directed sets. The notion of irreducibility here is that of a nonempty set that cannot be covered by two closed sets except if already one of the sets is covering it. Since directed sets are the irreducible sets for the Alexandroff topology on a partially ordered set, this is a natural generalization. It allows a remarkable characterization of sober spaces. For this we denote by QX the space of nonempty compact saturated subsets (with the upper Vietoris topology) of a topological space X. The following properties are equivalent: (1) X is sober, (2) QX is sober, (3) X is strongly well-filtered in the following sense: Whenever A is an irreducible subset of QX and U an open subset of X such that ⋂ A ⊆ U , then K ⊆ U for some K ∈ A. This result fills a gap in the existing literature.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Clause-logical Aspects of the Smyth Powerdomain

Synopsis. In this paper we study the logical aspects of the Smyth powerdomain via clausal theories. The clause-theoretic view leads to an unexpectedly simple, operational, representation of the Smyth powerdomain. At the heart of this representation is a hyperresolution rule, whose completeness hinges upon a combinatorial lemma for the book-keeping of intermediate clauses. These results are moti...

متن کامل

Resolution in the Smyth powerdomain

The purposes of this paper are (i) to give a new, eecient representation of Smyth powerdomains as 0-inhabited information systems, following the style of Scott; (ii) to introduce, as a consequence of this representation, a generalized resolution method for an arbitrary Smyth powerdomain and show the soundness and completeness of this method. The connection of (i) with (ii) comes from the observ...

متن کامل

Model-Checking View-Based Partial Specifications

We develop foundations for the view-based specification of software artifacts in first-order logic. Standard notions of models and semantics of first-order logic are generalized to partial models that do not have access to the entire global signature. At the model-theoretic level, this is achieved via the Smyth powerdomain over the semantic universe of elements. At the logical level, we accompl...

متن کامل

A Note on the Smyth Powerdomain Construction

Powerdomains are the order-theoretic analogue of powersets and are used to model non-determinism and concurrency [9, 8, 3, 10]. There exist three standard kinds of order-theoretic powerdomain: the Plotkin, Smyth and Hoare powerdomain. To obtain a powerdomain from a given !-algebraic cpo D, one constructs the collection F(D) of finite, non-empty sets of finite elements from D (for necessary defi...

متن کامل

A Note on Powerdomains and Modalitiy

This note shows a simple connection between powerdomains and modal assertions that can be made about nondeterministic computations. We consider three kinds of powerdomains, the Plotkin powerdomain, the Smyth powerdomain and one Christened the Hoare power domain by Plotkin because it captures the partial correctness of a nondeterministic program. The modal operators are • for "inevitably" and <>...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 298  شماره 

صفحات  -

تاریخ انتشار 2013